An Interpolating Theorem Prover
نویسنده
چکیده
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem prover based on this method. The prover has been used for predicate refinement in the Blast software model checker, and can also be used directly for model checking infinite-state systems, using interpolation-based image approximation.
منابع مشابه
Quantified Invariant Generation Using an Interpolating Saturation Prover
Interpolating provers have a variety of applications in verification, including invariant generation and abstraction refinement. Here, we extended these methods to produce universally quantified interpolants and invariants, allowing the verification of programs manipulating arrays and heap data structures. We show how a paramodulation-based saturation prover, such as SPASS, can be modified in a...
متن کاملIntegrating Decision Procedures in Reflective Rewriting-Based Theorem Provers ?
We propose a design for the integration of decision procedures in reflective rewritingbased equational theorem provers. Rewriting-based equational theorem provers use term rewriting as their basic proof engine; they are particularly well suited for proving properties of equational specifications. A reflective rewriting-based theorem prover is itself an executable equational specification, which...
متن کاملThe PIE Environment for First-Order-Based Proving, Interpolating and Eliminating
The PIE system aims at providing an environment for creating complex applications of automated first-order theorem proving techniques. It is embedded in Prolog. Beyond actual proving tasks, also interpolation and second-order quantifier elimination are supported. A macro feature and a LTEX formula pretty-printer facilitate the construction of elaborate formalizations from small, understandable ...
متن کاملA Verification Toolkit for Numerical Transition Systems
1 Swiss Federal Institute of Technology Lausanne (EPFL) 2 Verimag, Grenoble, France 3 Uppsala University, Sweden Abstract. This paper reports on an effort to create benchmarks and a toolkit for rigorous verification problems, simplifying tool integration and eliminating ambiguities of complex programming language constructs. We focus on Integer Numerical Transition Systems (INTS), which can be ...
متن کاملMSPASS: Modal Reasoning by Translation and First-Order Resolution
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for the relational cal-
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 345 شماره
صفحات -
تاریخ انتشار 2004